A New Merit Function and an Sqp Method for Non-strictly Monotone Variational Inequalities
نویسنده
چکیده
Merit functions utilized to monitor the convergence of sequential quadratic programming (SQP) methods for nonlinear programs and variational inequality problems have in common that they include a penalty function for the explicit constraints, the value of the penalty parameter for which is subject to the requirement of being large enough compared to estimates of the optimal Lagrange multipliers. In existing applications of the SQP algorithm to variational inequality problems, the possible choices of merit functions used in descent algorithms are also limited by conditions which require the knowledge of problem parameters. This paper introduces a merit function for use in SQP methods for possibly non-strictly monotone variational inequality problems and which does not include an explicit penalty function and whose application in descent algorithms does not require the knowledge of any problem parameters. This function is an extension of the merit function of Marcotte and Zhu (1995) to primal{dual variational inequality problems. Among its other properties, it is directionally diierentiable, and exact for strongly monotone problems. Based on the new merit function, we establish the convergence of a general algorithm for primal{ dual variational inequalities which includes an adaptive SQP algorithm as a special case.
منابع مشابه
An inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملApproximating fixed points of nonexpansive mappings and solving systems of variational inequalities
A new approximation method for the set of common fixed points of nonexpansive mappings and the set of solutions of systems of variational inequalities is introduced and studied. Moreover, we apply our main result to obtain strong convergence theorem to a common fixed point of a nonexpannsive mapping and solutions of a system of variational inequalities of an inverse strongly mono...
متن کاملSolutions of variational inequalities on fixed points of nonexpansive mappings
n this paper , we propose a generalized iterative method forfinding a common element of the set of fixed points of a singlenonexpannsive mapping and the set of solutions of two variationalinequalities with inverse strongly monotone mappings and strictlypseudo-contractive of Browder-Petryshyn type mapping. Our resultsimprove and extend the results announced by many others.
متن کاملA Relaxed Extra Gradient Approximation Method of Two Inverse-Strongly Monotone Mappings for a General System of Variational Inequalities, Fixed Point and Equilibrium Problems
متن کامل
Error bounds for proximal point subproblems and associated inexact proximal point algorithms
We study various error measures for approximate solution of proximal point regularizations of the variational inequality problem, and of the closely related problem of finding a zero of a maximal monotone operator. A new merit function is proposed for proximal point subproblems associated with the latter. This merit function is based on Burachik-Iusem-Svaiter’s concept of ε-enlargement of a max...
متن کامل